Proof Nets, Garbage, and Computations
نویسندگان
چکیده
We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic (MELL) proof nets. The main novelty is in a complete set of rewriting rules for cut-elimination in presence of weakening (which requires garbage collection). The proposed reduction system is strongly normalizing and confluent. Abstract: We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic (MELL) proof nets. The main novelty i s in a complete set of rewriting rules for cut-elimination in presence of weakening (which requires garbage collection). The proposed reduction system is strongly normalizing and connuent.
منابع مشابه
Proof nets , Garbage , and Computations 1
Stefano Guerrini a Simone Martini c Andrea Masini b aDipartimento di Scienze dell’Informazione Università di Roma ‘La Sapienza’ Via Salaria, 113 I-00198, Roma, Italy email: [email protected] bDipartimento di Matematica, Università di Trento Via Sommarive 14 I-38050, Trento, Italy email: [email protected] cDipartimento di Matematica e Informatica, Università di Udine Via delle Scien...
متن کاملAllegories of Circuits
This paper presents three paradigms for circuit design, and investigates the relationships between them. These paradigms are syntactic (based on Freyd and Scedrov's unitary pre-tabular allegories (upas)), pictorial (based on the net list model of circuit connectivity), and relational (based on Sheeran's relational model of circuit design Ruby). We show that net lists over a given signature cons...
متن کاملYet Another Correctness Criterion for Multiplicative Linear Logic with MIX
A new correctness criterion for discriminating Proof Nets among Proof Structures of Multiplicative Linear Logic with MIX rule is provided. This criterion is inspired by an original interpretation of Proof Structures as distributed systems, and logical formulae as processes. The computation inside a system corresponds to the logical ow of information inside a proof, that is, roughly, a distribut...
متن کاملConcurrent programming as proof net construction
We propose a concurrent process calculus, called Calcul Parall ele Logique (CPL), based on the paradigm of computation as proof net construction in linear logic. CPL uses a fragment of rst order intuitionistic linear logic where formulas represent processes and proof nets successful computations. In these computations, communication is expressed in an asynchronous way by means of axiom links. W...
متن کامل